Geometric Properties of the Adaptive Delaunay Tessellation
نویسندگان
چکیده
Recently, the Adaptive Delaunay Tessellation (Adt) was introduced in the context of computational mechanics as a tool to support Voronoi-based nodal integration schemes in the finite element method. While focusing on applications in mechanical engineering, the former presentation lacked rigorous proofs for the claimed geometric properties of the Adt necessary for the computation of the nodal integration scheme. This paper gives pending proofs for the three main claims which are uniqueness of the Adt, connectedness of the Adt, and coverage of the Voronoi tiles by adjacent Adt tiles. Furthermore, this paper provides a critical assessment of the Adt for arbitrary point sets.
منابع مشابه
Robust Tessellation of Trimmed Rational B-Spline Surface Patches
We present an unstructured triangular mesh generation algorithm that approximates a set of mutually non-intersecting simple trimmed rational B-spline surface patches within a user specified geometric tolerance. The proposed method uses numerically robust interval geometric representations/computations and also addresses the problem of topological consistency (homeomorphism) between the exact ge...
متن کاملAn Automatic Adaptive Re nement and Dere nement Method for D Elliptic Problems
We present the theory and implementation for a new automatic adaptive h re nement and dere nement method for two and three dimensional elliptic problems An exact lower error bound for dere nement is obtained theoretically in terms of the nite element solution complementing the various known upper error bounds for re nement These error bounds are used to determine where to insert and or remove m...
متن کاملA Distributed Delaunay Triangulation Algorithm Based on Centroid Voronoi Tessellation for Wireless Sensor Networks
A wireless sensor network can be represented by a graph. While the network graph is extremely useful, it often exhibits undesired irregularity. Therefore, special treatment of the graph is required by a variety of network algorithms and protocols. In particular, many geometry-oriented algorithms depend on a type of subgraph called Delaunay triangulation. However, when location information is un...
متن کاملAn Automatic Adaptive Reenement and Dereenement Method for 3d Elliptic Problems
We present the theory and implementation for a new automatic adaptive h-re nement and -dere nement method for twoand three-dimensional elliptic problems. An exact lower error bound for dere nement is obtained theoretically in terms of the nite element solution, complementing the various known upper error bounds for re nement. These error bounds are used to determine where to insert and/or remov...
متن کاملRobust Tesselation of Trimmed Rational B-Spline Surface Patches
We present an unstructured triangular mesh generation algorithm that approximates a set of mutually non-intersecting simple trimmed rational B-spline surface patches within a user speciied geometric tolerance. The proposed method uses numerically robust interval geometric representations/computations and also addresses the problem of topological consistency (homeomorphism) between the exact geo...
متن کامل